Parallelism for Single Loops with Multiple Dependences
نویسندگان
چکیده
منابع مشابه
Improving Parallelism of Nested Loops with Non-uniform Dependences
This paper defines the properties of FDT (Flow Dependence Tail set) and FDH (Flow Dependence Head set), and presents two partitioning methods for finding two parallel regions in two-dimensional solution space. One is the region partitioning method by intersection of FDT and FDH. Another is the region partitioning method by two given equations. Both methods show how to determine whether the inte...
متن کاملAn Optimized Three Region Partitioning Technique to Maximize Parallelism of Nested Loops With Non-uniform Dependences
There are many methods for nested loop partitioning exist; however, most of them perform poorly when they partition loops with non-uniform dependences. This paper proposes a generalized and optimized loop partitioning mechanism which can exploit parallelism in nested loops with non-uniform dependences. Our approach based on the region partitioning technique divides the loop into variable size p...
متن کاملSingle-Setup-Multiple-Deliveries for a Single Supplier-Single Buyer with Single Product and Backorder
This article investigates integrated production-inventory models with backorder. A single supplier and a single buyer are considered and shortage as backorder is allowed for the buyer. The proposed models determine optimal order quantity, optimal backorder quantity and optimal number of deliveries on the joint total cost for both buyer and supplier. Two cases are discussed: single-setup-singl...
متن کاملParallelization of Loops with Variable Distance Data Dependences
The extent of parallelization of a loop is largely determined by the dependences between its statements. While dependence free loops are fully parallelizable, those with loop carried dependences are not. Dependence distance is a measure of absolute difference between a pair of dependent iterations. Loops with constant distance data dependence(CD3), because of uniform distance between the depend...
متن کاملEigenvectors-based parallelisation of nested loops with affine dependences
Abstract This paper presents a method for parallelising nested loops with affine dependences. The data dependences of a program are represented exactly using a dependence matrix rather than an imprecise dependence abstraction. By a careful analysis of the eigenvectors and eigenvalues of the dependence matrix, we detect the parallelism inherent in the program, partition the iteration space of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Contents
سال: 2007
ISSN: 1738-6764
DOI: 10.5392/ijoc.2007.3.3.015